Constraint Solving using Parallel Singleton Arc Consistency
نویسندگان
چکیده
In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we present a new approach using parallel consistencies to enhance the classic solving process. In fact, a master process tries to resolve a constraint satisfaction problem while using the results of consistency tests done by auxiliary workers to avoid some useless branching.
منابع مشابه
Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency
The constraint propagation process is a powerful tool for solving constraint satisfaction problems (CSPs). We propose a filtering technique which exploits at best this tool in order to improve the pruning e ciency. This technique, combining domain partition and arc consistency, generalizes and improves the pruning e ciency of the arc consistency, and the singleton arc consistency filtering tech...
متن کاملOn Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ...
متن کاملCycle-Based Singleton Local Consistencies
We propose to exploit cycles in the constraint network of a Constraint Satisfaction Problem (CSP) to vehicle constraint propagation and improve the effectiveness of local consistency algorithms. We focus our attention on the consistency property Partition-One Arc-Consistency (POAC), which is a stronger variant of Singleton Arc-Consistency (SAC). We modify the algorithm for enforcing POAC to ope...
متن کاملSingleton Arc Consistency Revised
Consistency techniques make a main flavour of most constraint satisfaction algorithms. Their goal is to remove as many as possible inconsistencies from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus it achieves even better domain pruning. The paper presents a new algorithm for singleton a...
متن کاملA New Algorithm for Singleton Arc Consistency
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search space by removing as many as possible inconsistent values from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus ...
متن کامل